Restricted Types for HOL
نویسنده
چکیده
Restricted types is a method for incorporating the expres-siveness of predicate types in HOL without modifying the HOL type langauge. Restricted types allow predicate restrictions to be placed on the values of HOL constants. Dependant and predicate typing can be approximated using restricted types. The work presented here has been implemented in SML as an extra-logical aid to the development of HOL theories.
منابع مشابه
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term operations for type abstraction and type application. The formation of type application terms t [T ] is restricted to small types T that do not contain any universal types. This constraint ensures the existence of a set-theoreti...
متن کاملHow to Encode Polymorphic Types Safely and Efficiently
Most automatic theorem provers are restricted to untyped or monomorphic logics, and existing translations from polymorphic logics are either bulky or unsound. Recent research shows how to exploit monotonicity to encode ground types efficiently: monotonic types can be safely erased, while nonmonotonic types must generally be encoded. We extend this work to rank-1 polymorphism and show how to eli...
متن کاملNumeric Types in Formal Synthesis
The Formal Synthesis methodology can be considered as the application of the transformational approach to circuit synthesis by logical transformations performed in a theorem prover. Additionally to the implementation of the circuit, the proof that the result is a correct implementation of a given specification is obtained automatically. In this paper, a higher-order formalisation for the arithm...
متن کاملRefinement Through Restraint: Bringing Down the Cost of Verification
We present a framework aimed at significantly reducing the cost of verifying certain classes of systems software, such as file systems. Our framework allows for equational reasoning about systems code written in our new language, Cogent. Cogent is a restricted, polymorphic, higher-order, and purely functional language with linear types and without the need for a trusted runtime or garbage colle...
متن کاملEncoding Monomorphic and Polymorphic Types
Most automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996